https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 On the parameterized complexity of multiple-interval graph problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7815 Sat 24 Mar 2018 08:37:37 AEDT ]]> Visual cryptography scheme for graphs with vertex covering number two https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:28824 G = (V, E) be a graph without isolated vertices. Let m*(G) denote the optimal pixel expansion of a visual cryptography scheme for the strong access structure Γ(G) on V whose basis is E. In this paper we determine m*(G) for any connected graph G with vertex covering number two.]]> Sat 24 Mar 2018 07:38:27 AEDT ]]> On equality in an upper bound for the equivalence domination number https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26705 e(G) is the minimum cardinality of an equivalence dominating set of G. In this paper we investigate the structure of graphs G satisfying γe (G) = ∣V (G)∣ – ∆(G).]]> Sat 24 Mar 2018 07:26:20 AEDT ]]>